Package | Description |
---|---|
oracle.pgx.api |
This package contains the Java APIs of PGX.
|
oracle.pgx.api.admin |
This package contains the administrative interfaces of PGX.
|
Modifier and Type | Method and Description |
---|---|
PgxFuture<Void> |
PgxCollection.addAllAsync(Collection<E> source)
Add vertices/edges to an existing vertex/edge collection
|
PgxFuture<Void> |
PgxCollection.addAllAsync(E[] elements)
Add vertices/edges to an existing vertex/edge collection
|
PgxFuture<Void> |
ServerInstance.addPinnedGraphAsync(GraphConfig cfg)
Add a pinned graph (will not be unloaded by engine) to be shared between sessions
|
static <T> PgxFuture<Void> |
PgxFuture.allOf(List<PgxFuture<T>> promises) |
<ID extends Comparable<ID>> |
Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k)
Approximate vertex betweenness centrality (without considering edge length).
|
<ID extends Comparable<ID>> |
Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, PgxVertex<ID>... seeds)
Approximate vertex betweenness centrality (without considering edge length).
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromLeftSetAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, String newGraphName)
Create a bipartite version of a graph.
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromLeftSetAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, String newGraphName, String isLeftPropName) |
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet<?> vertexSet)
Create a bipartite version of a graph.
#bipartiteSubGraphFromLeftSet(Collection, Collection, VertexSet) Passing vertexProps as VertexProperty.ALL edgeProps as EdgeProperty.ALL |
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet<?> vertexSet, String newGraphName)
Create a bipartite version of a graph.
|
PgxFuture<T> |
PgxFuture.cancelOn(PgxFuture promise)
If given promise completes exceptionally because it was canceled,
cancel() gets called on this promise as well. |
PgxFuture<Void> |
PgxCollection.clearAsync()
Clear an existing vertex/edge collection
|
PgxFuture<VertexProperty<ID,V>> |
VertexProperty.cloneAsync() |
PgxFuture<PgxGraph> |
PgxGraph.cloneAsync()
Convenience method of
PgxGraph.cloneAsync(String) Passing String(name) as null Create a copy of a graph. |
PgxFuture<? extends Property<ID,K,V>> |
Property.cloneAsync()
Create a copy of this property.
Convenience method for Property.cloneAsync(String) passing newPropertyName as null |
PgxFuture<PgxCollection<E,ID>> |
PgxCollection.cloneAsync()
Convenience method around
PgxCollection.cloneAsync(String) passing name as null Clone an existing vertex/edge collection. |
PgxFuture<PgxGraph> |
PgxGraph.cloneAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, String newGraphName)
Create a copy of a graph.
|
PgxFuture<VertexProperty<ID,V>> |
VertexProperty.cloneAsync(String newPropertyName) |
PgxFuture<PgxGraph> |
PgxGraph.cloneAsync(String newGraphName)
Convenience method of
PgxGraph.cloneAsync(Collection, Collection, String) Passing Collection(vertexProperties) as VertexProperty.ALL Collection(edgeProperties) as EdgeProperty.ALL Create a copy of a graph. |
PgxFuture<? extends Property<ID,K,V>> |
Property.cloneAsync(String newPropertyName)
Create a copy of this property.
|
PgxFuture<PgxCollection<E,ID>> |
PgxCollection.cloneAsync(String newName)
Clone an existing vertex/edge collection.
|
<ID extends Comparable<ID>> |
Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<Double> cost)
Compute closed centrality.
|
<ID extends Comparable<ID>> |
Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph)
Compute closed centrality.
|
<ID extends Comparable<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph)
Detect communities using parallel label propagation.
|
PgxFuture<CompiledProgram> |
PgxSession.compileProgramAsync(InputStream code)
Deprecated.
|
PgxFuture<CompiledProgram> |
PgxSession.compileProgramAsync(String path)
Deprecated.
|
PgxFuture<CompiledProgram> |
PgxSession.compileProgramCodeAsync(String code)
Deprecated.
|
static <T> PgxFuture<T> |
PgxFuture.completedFuture(T arg) |
PgxFuture<Boolean> |
PgxMap.containsKeyAsync(K key)
Checks if the map contains key.
|
PgxFuture<Long> |
Analyst.countTrianglesAsync(PgxGraph graph, boolean sortVerticesByDegree)
Counts the number of 'triads' in the given undirected graph.
|
<ID extends Comparable<ID>> |
PgxGraph.createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Creates a
AllPaths object representing all the shortest paths from a single source to all the possible destinations (shortest regarding the given edge costs). |
<ID extends Comparable<ID>> |
PgxGraph.createComponentsAsync(VertexProperty<ID,Integer> components, int numComponents)
Creates a
Partition object holding a collection of vertex sets, each representing a component. |
<V extends Comparable<V>> |
PgxGraph.createEdgePropertyAsync(PropertyType type)
Creates a session-bound edge property
|
<V extends Comparable<V>> |
PgxGraph.createEdgePropertyAsync(PropertyType type, String name)
Creates a session-bound edge property
|
PgxFuture<EdgeSequence> |
PgxGraph.createEdgeSequenceAsync()
Creates a new Edge Sequence.
|
PgxFuture<EdgeSequence> |
PgxGraph.createEdgeSequenceAsync(String name)
Creates a new Edge Sequence.
|
PgxFuture<EdgeSet> |
PgxGraph.createEdgeSetAsync()
Creates a new Edge Set.
|
PgxFuture<EdgeSet> |
PgxGraph.createEdgeSetAsync(String name)
Creates a new Edge Set.
|
<K extends Comparable<K>,V extends Comparable<V>> |
PgxGraph.createMapAsync(PropertyType keyType, PropertyType valType)
Creates a session-bound map
|
<K extends Comparable<K>,V extends Comparable<V>> |
PgxGraph.createMapAsync(PropertyType keyType, PropertyType valType, MapType mapType)
Creates a session-bound map
|
<K extends Comparable<K>,V extends Comparable<V>> |
PgxGraph.createMapAsync(PropertyType keyType, PropertyType valType, MapType mapType, String mapName)
Creates a session-bound map
|
<ID extends Comparable<ID>> |
PgxGraph.createPathAsync(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Creates a
PgxPath object representing the shortest path from one source to one destination (shortest regarding the given edge costs). |
<T> PgxFuture<Scalar<T>> |
PgxGraph.createScalarAsync(PropertyType type)
Creates a new Scalar.
|
<T> PgxFuture<Scalar<T>> |
PgxGraph.createScalarAsync(PropertyType type, String newScalarName)
Create a session-bound scalar.
|
PgxFuture<PgxSession> |
ServerInstance.createSessionAsync(String source)
Create a new session.
|
PgxFuture<PgxSession> |
ServerInstance.createSessionAsync(String source, Long idleTimeout, Long taskTimeout, TimeUnit unit)
Creates a new session.
|
<ID extends Comparable<ID>,V extends Comparable<V>> |
PgxGraph.createVertexPropertyAsync(PropertyType type)
Creates a session-bound vertex property
|
<ID extends Comparable<ID>,V extends Comparable<V>> |
PgxGraph.createVertexPropertyAsync(PropertyType type, String name)
Creates a session-bound vertex property
|
<E extends Comparable<E>> |
PgxGraph.createVertexSequenceAsync()
Creates a new Vertex Sequence.
|
<E extends Comparable<E>> |
PgxGraph.createVertexSequenceAsync(String name)
Creates a new Vertex Sequence.
|
<E extends Comparable<E>> |
PgxGraph.createVertexSetAsync()
Creates a new Vertex Set.
|
<E extends Comparable<E>> |
PgxGraph.createVertexSetAsync(String name)
Creates a new Vertex Set.
|
<ID extends Comparable<ID>> |
Analyst.degreeCentralityAsync(PgxGraph graph)
Compute degree centrality.
|
PgxFuture<Void> |
ServerInstance.demotePinnedGraphAsync(GraphConfig cfg)
Demote pinned graph.
|
PgxFuture<Void> |
Destroyable.destroyAsync()
Requests destruction of this object.
|
<ID extends Comparable<ID>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge)
Compute eigenvector centrality using power iteration (with L1 norm).
|
PgxFuture<Iterable<Map.Entry<K,V>>> |
PgxMap.entriesAsync()
Gets an entry set.
|
static <T> PgxFuture<T> |
PgxFuture.exceptionallyCompletedFuture(Throwable th) |
<V extends Comparable<V>> |
VertexSet.extractTopKFromMapAsync(PgxMap<PgxVertex<ID>,V> map, int k)
Extracts the top k keys from the given map and puts them into this collection.
|
<ID extends Comparable<ID>> |
Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<Double> capacity)
Fattest Tree Algorithm - Computes the fattest path from a source vertex to all vertices in the graph.
|
PgxFuture<Void> |
Property.fillAsync(V value)
Fill this property with a given value.
|
PgxFuture<PgxGraph> |
PgxGraph.filterAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, GraphFilter graphFilter, String newGraphName)
Create a subgraph of a graph.
|
PgxFuture<PgxGraph> |
PgxGraph.filterAsync(GraphFilter graphFilter)
Create a subgraph of a graph.
|
PgxFuture<PgxGraph> |
PgxGraph.filterAsync(GraphFilter graphFilter, String newGraphName)
Create a subgraph of a graph.
|
PgxFuture<V> |
Scalar.getAsync() |
PgxFuture<V> |
Property.getAsync(ID id)
Gets the property value.
|
PgxFuture<V> |
PgxMap.getAsync(K key)
Gets the value of a key.
|
PgxFuture<V> |
Property.getAsync(K key)
Gets the property value.
|
PgxFuture<Deque<GraphMetaData>> |
PgxSession.getAvailableSnapshotsAsync(GraphConfig config)
Gets a list of available in-memory snapshots of a graph described by a graph configuration.
|
PgxFuture<Deque<GraphMetaData>> |
PgxSession.getAvailableSnapshotsAsync(PgxGraph snapshot)
Gets a list of available in-memory snapshots of a given snapshot.
|
PgxFuture<Iterable<Map.Entry<K,V>>> |
Property.getBottomKValuesAsync(int k)
Gets the bottom k vertex/edge value pairs according to their value.
|
PgxFuture<Set<EdgeProperty<?>>> |
PgxGraph.getEdgePropertiesAsync()
Get the set of edge properties belonging to this graph.
|
<V extends Comparable<V>> |
PgxGraph.getEdgePropertyAsync(String name)
get an edge property of this graph
|
<E extends Comparable<E>> |
PgxGraph.getEdgesAsync(EdgeFilter filter)
Creates a new Edge Set containing edges according to the given filter expression.
|
PgxFuture<GraphInfo> |
ServerInstance.getGraphInfoAsync(String graphName)
Get details of a (shared) persistent graph
|
PgxFuture<GraphInfo> |
ServerInstance.getGraphInfoAsync(String sessionId, String graphName)
Get details of a session-bound, private graph
|
PgxFuture<Collection<GraphInfo>> |
ServerInstance.getGraphInfosAsync()
Get a list of currently active graphs.
|
<ID extends Comparable<ID>> |
BipartiteGraph.getIsLeftPropertyAsync()
Gets the 'is Left' vertex property of the graph.
|
PgxFuture<MemoryInfo> |
ServerInstance.getMemoryInfoAsync()
Gets the memory info.
|
PgxFuture<Map<PgxConfig.Field,Object>> |
ServerInstance.getPgxConfigAsync()
Gets the PGX config.
|
<V extends Comparable<V>> |
PgxEdge.getPropertyAsync(String propertyName)
Gets the value of a property.
|
<V extends Comparable<V>> |
PgxVertex.getPropertyAsync(String propertyName)
Gets the value of a property.
|
PgxFuture<SessionInfo> |
ServerInstance.getSessionInfoAsync(String sessionId)
Gets the session info.
|
PgxFuture<Collection<SessionInfo>> |
ServerInstance.getSessionInfosAsync()
Gets the session infos.
|
PgxFuture<PoolInfo> |
ServerInstance.getThreadPoolInfoAsync(PoolType type)
Gets the thread pool info.
|
PgxFuture<Iterable<Map.Entry<K,V>>> |
Property.getTopKValuesAsync(int k)
Gets the top k vertex/edge value pairs according to their value.
|
PgxFuture<Iterable<Map.Entry<K,V>>> |
Property.getValuesAsync()
Gets the values.
|
PgxFuture<Set<VertexProperty<?,?>>> |
PgxGraph.getVertexPropertiesAsync()
Get the set of vertex properties belonging to this graph.
|
<ID extends Comparable<ID>,V extends Comparable<V>> |
PgxGraph.getVertexPropertyAsync(String name)
Gets a vertex property of this graph
|
<E extends Comparable<E>> |
PgxGraph.getVerticesAsync(VertexFilter filter)
Creates a new Vertex Set containing vertices according to the given filter expression.
|
<ID extends Comparable<ID>> |
Analyst.hitsAsync(PgxGraph graph, int max)
Classic HITS algorithm (Hyperlink-Induced Topic Search, aka.
|
<ID extends Comparable<ID>> |
Analyst.inDegreeCentralityAsync(PgxGraph graph)
Compute in-degree centrality.
|
PgxFuture<PgxMap<Integer,Long>> |
Analyst.inDegreeDistributionAsync(PgxGraph graph)
Computes the indegree distribution of the given graph and stores it in a map.
|
PgxFuture<Boolean> |
ServerInstance.isEngineRunningAsync()
Check if the engine is currently up
|
PgxFuture<Boolean> |
PgxGraph.isFreshAsync()
Check whether an in-memory representation of a graph is fresh.
|
PgxFuture<Iterator<E>> |
PgxCollection.iteratorAsync()
Gets an Iterator over the collection.
|
PgxFuture<Iterable<K>> |
PgxMap.keysAsync() |
PgxFuture<Void> |
ServerInstance.killSessionAsync(String sessionId)
Kill a session.
|
PgxFuture<GraphConfig> |
ServerInstance.lookupPreloadedGraphAsync(String name)
Looks up the config of a pre-loaded graph by name.
|
<ID extends Comparable<ID>> |
Analyst.outDegreeCentralityAsync(PgxGraph graph)
Compute out-degree centrality.
|
PgxFuture<PgxMap<Integer,Long>> |
Analyst.outDegreeDistributionAsync(PgxGraph graph)
Computes the outdegree distribution of the given graph and stores it in a map.
|
<ID extends Comparable<ID>> |
Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max)
Classic pagerank algorithm.
|
<ID extends Comparable<ID>> |
Analyst.partitionConductanceAsync(PgxGraph graph, Partition<ID> partition)
Compute the conductance of a partition.
|
<ID extends Comparable<ID>> |
Analyst.partitionModularityAsync(PgxGraph graph, Partition<ID> partition)
Compute the modularity of a partition.
|
<ID extends Comparable<ID>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
|
<ID extends Comparable<ID>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID extends Comparable<ID>> |
PgxGraph.pickRandomVertexAsync()
Picks a random vertex in the graph.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config)
Reads a graph and its properties, specified a graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config, boolean forceUpdateIfNotFresh)
Reads a graph and its properties, specified a graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config, boolean forceUpdateIfNotFresh, String newGraphName)
Reads a graph and its properties, specified a graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config, long maxAge, TimeUnit maxAgeTimeUnit)
Reads a graph and its properties, specified a graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config, long maxAge, TimeUnit maxAgeTimeUnit, boolean blockIfFull, String newGraphName)
Reads a graph and its properties, specified a graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config, String newGraphName)
Reads a graph and its properties, specified a graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(String path)
Reads a graph and its properties, specified by a path to a graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(String path, String newGraphName)
Reads a graph and its properties, specified by a path to a graph config, into memory.
|
PgxFuture<Void> |
PgxCollection.removeAllAsync(Collection<E> source)
Remove vertices/edges from an existing vertex/edge collection
|
PgxFuture<Boolean> |
PgxMap.removeAsync(K key)
Removes the entry specified by the given key from the map with the given name.
|
PgxFuture<Void> |
ServerInstance.resizePoolAsync(PoolType poolType, int parallelism)
Resize a pool to use a different degree of parallelism
|
<ID extends Comparable<ID>> |
Analyst.salsaAsync(BipartiteGraph graph, int k)
Convenience method around
Analyst.salsaAsync(BipartiteGraph, int, double, double, int) using maxDiff = 0.01 d = 0.85 maxIter = 1000 |
<ID extends Comparable<ID>> |
Analyst.salsaAsync(BipartiteGraph graph, int k, double maxDiff, double d, int maxIter)
SALSA recommendation algorithm.
|
<ID extends Comparable<ID>> |
Analyst.sccKosarajuAsync(PgxGraph graph)
Find strongly connected components using Kosaraju's algorithm.
|
<ID extends Comparable<ID>> |
Analyst.sccTarjanAsync(PgxGraph graph)
Find strongly connected components using Tarjan's algorithm.
|
PgxFuture<Void> |
PgxMap.setAsync(K key, V value)
Sets the value for a key in the map specified by the given name.
|
PgxFuture<Void> |
Property.setAsync(K key, V value) |
PgxFuture<Void> |
Scalar.setAsync(V value)
Sets the scalar value.
|
PgxFuture<Void> |
PgxSession.setSnapshotAsync(PgxGraph graph, GraphMetaData metaData)
Sets a graph to a specific snapshot.
|
PgxFuture<Void> |
PgxSession.setSnapshotAsync(PgxGraph graph, GraphMetaData metaData, boolean forceDeleteTransientProperties)
Sets a graph to a specific snapshot.
|
PgxFuture<Void> |
PgxSession.setSnapshotAsync(PgxGraph graph, long creationTimestamp)
Sets a graph to a specific snapshot.
|
PgxFuture<Void> |
PgxSession.setSnapshotAsync(PgxGraph graph, long creationTimestamp, boolean forceDeleteTransientProperties)
Sets a graph to a specific snapshot.
|
PgxFuture<Void> |
Property.setValuesAsync(Map<K,V> values) |
PgxFuture<Void> |
Property.setValuesAsync(Map<K,V> values, V defaultValue)
Sets the values of a property.
|
<ID extends Comparable<ID>> |
Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<Double> cost)
Compute single source shortest paths using Bellman & Ford algorithm time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
|
<ID extends Comparable<ID>> |
Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<Double> cost)
Compute reverse single source shortest paths using Bellman & Ford algorithm time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
|
<ID extends Comparable<ID>> |
Analyst.shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)
Compute shortest path using Dijkstra's algorithm.
|
<ID extends Comparable<ID>> |
Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)
Compute shortest path using a bi-directional Dijkstra variant.
|
<ID extends Comparable<ID>> |
Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)
Compute shortest path using Dijkstra's algorithm on a filtered graph The filter specified by the given filter expression is applied on each edge during traversal of the graph.
|
<ID extends Comparable<ID>> |
Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)
Compute shortest path using a bi-directional Dijkstra variant on a filtered graph.
|
<ID extends Comparable<ID>> |
Analyst.shortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src)
Compute hop-distance from given vertex to every other vertex time complexity: O(E * d) with E = number of edges, d = diameter of graph
|
<ID extends Comparable<ID>> |
Analyst.shortestPathHopDistReverseAsync(PgxGraph graph, PgxVertex<ID> src)
Compute reverse hop-distance from given vertex to every other vertex time complexity: O(E * d) with E = number of edges, d = diameter of graph
|
PgxFuture<Boolean> |
ServerInstance.shutdownEngineAsync(long timeout, TimeUnit unit)
Gracefully shuts down the engine and cleans up resources.
|
PgxFuture<Void> |
ServerInstance.shutdownEngineNowAsync()
Forces the engine to stop and clean up resources.
|
PgxFuture<Void> |
ServerInstance.shutdownEngineNowIfRunningAsync()
If the engine is currently up forces it to stop and clean up resources.
|
PgxFuture<PgxGraph> |
PgxGraph.simplifyAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, String newGraphName)
Create a simplified version of a graph.
|
PgxFuture<PgxGraph> |
PgxGraph.simplifyAsync(PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, String newGraphName)
Convenience method for
PgxGraph.simplifyAsync(Collection, Collection, MultiEdges, SelfEdges, TrivialVertices, Mode, String) Passing Collection(vertexProperties) as VertexProperty.ALL Collection(edgeProperties) as EdgeProperty.ALL Create a simplified version of a graph. |
PgxFuture<Integer> |
PgxMap.sizeAsync()
Returns the size of the map
|
PgxFuture<Long> |
Property.sizeAsync()
Size.
|
PgxFuture<Integer> |
PgxCollection.sizeAsync()
Gets the number of elements in this collection
|
PgxFuture<PgxGraph> |
PgxGraph.sortByDegreeAsync()
Create a sorted version of a graph and all its properties.
|
PgxFuture<PgxGraph> |
PgxGraph.sortByDegreeAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, PgxGraph.Direction direction, PgxGraph.Degree degree, PgxGraph.Mode mode, String newGraphName)
Create a sorted version of a graph and all its properties.
|
PgxFuture<PgxGraph> |
PgxGraph.sortByDegreeAsync(PgxGraph.Direction direction, PgxGraph.Degree degree, PgxGraph.Mode mode, String newGraphName)
Create a sorted version of a graph and all its properties.
|
PgxFuture<PgxGraph> |
PgxGraph.sortByDegreeAsync(String newGraphName)
Create a sorted version of a graph and all its properties.
|
PgxFuture<PgxGraph> |
PgxGraph.sparsifyAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, double e, String newGraphName)
Sparsifies the given graph and returns a new graph with less edges.
|
PgxFuture<PgxGraph> |
PgxGraph.sparsifyAsync(double e)
Sparsifies the given graph and returns a new graph with less edges.
Convenience method around PgxGraph.sparsify(double, String) Passing newGraphName as null |
PgxFuture<PgxGraph> |
PgxGraph.sparsifyAsync(double e, String newGraphName)
Sparsifies the given graph and returns a new graph with less edges.
Convenience method around PgxGraph.sparsify(Collection, Collection, double, String) Passing vertexProps as VertexProperty.ALL edgeProps as EdgeProperty.ALL |
PgxFuture<Void> |
ServerInstance.startEngineAsync()
Starts the PGX engine.
|
PgxFuture<Void> |
ServerInstance.startEngineAsync(InputStream config)
Starts the PGX engine with a custom configuration.
|
PgxFuture<Void> |
ServerInstance.startEngineAsync(Map<PgxConfig.Field,Object> config)
Starts the PGX engine with a custom configuration.
|
PgxFuture<Void> |
ServerInstance.startEngineAsync(String path)
Starts the PGX engine with a custom configuration given as path.
|
PgxFuture<FileGraphConfig> |
PgxGraph.storeAsync(Format targetFormat, String targetPath) |
PgxFuture<FileGraphConfig> |
PgxGraph.storeAsync(Format targetFormat, String targetPath, boolean overwrite) |
PgxFuture<FileGraphConfig> |
PgxGraph.storeAsync(Format targetFormat, String targetPath, Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, boolean overwrite) |
PgxFuture<Void> |
PgxFuture.thenAccept(<any> block) |
<U> PgxFuture<U> |
PgxFuture.thenApply(<any> fn) |
PgxFuture<T> |
PgxFuture.thenComplete(PgxFuture<T> promise)
completes the given promise whenever this completes.
|
PgxFuture<T> |
PgxFuture.thenComplete(PgxFuture<T> promise, Runnable cleanup)
completes the given promise whenever this completes.
|
<U> PgxFuture<U> |
PgxFuture.thenCompose(<any> fn) |
PgxFuture<PgxGraph> |
PgxGraph.undirectAsync()
Convenience method around
PgxGraph.undirectAsync(String) Passing String(newGraphName) as null |
PgxFuture<PgxGraph> |
PgxGraph.undirectAsync(Collection<VertexProperty<?,?>> vertexProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, String newGraphName)
Create an undirected version of a graph.
|
PgxFuture<PgxGraph> |
PgxGraph.undirectAsync(PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, String newGraphName)
Convenience method for
PgxGraph.undirectAsync(Collection, MultiEdges, SelfEdges, TrivialVertices, Mode, String) Passing Collection(vertexProps) as VertexProperty.ALL |
PgxFuture<PgxGraph> |
PgxGraph.undirectAsync(String newGraphName)
Convenience method around
PgxGraph.undirectAsync(MultiEdges, SelfEdges, TrivialVertices, Mode, String) Passing MultiEdges as MultiEdges.KEEP_MULTI_EDGES SelfEdges as SelfEdges.KEEP_SELF_EDGES Trivial Vertices as TrivialVertices.KEEP_TRIVIALVERTICES Mode as Mode.CREATE_COPY |
<ID extends Comparable<ID>> |
Analyst.vertexBetweennessCentralityAsync(PgxGraph graph)
Compute vertex betweenness centrality (without considering edge length).
|
<ID extends Comparable<ID>> |
Analyst.wccAsync(PgxGraph graph)
Find weakly connected components through label propagation time complexity: O(E * D) with E = number of edges, D = diameter of the graph
|
<ID extends Comparable<ID>> |
Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max)
Convenience method around
Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double) using circleOfTrustSize = 500 randomWalkSteps = 50000 randomWalkResetProbablitiy = 0.15 salsaDampingFactor = 0.85 salsaMaxIterations = 1000 salsaMaxDiff = 0.01 |
<ID extends Comparable<ID>> |
Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff)
The Who to Follow recommendation algorithm by Twitter, Inc.
|
Modifier and Type | Method and Description |
---|---|
PgxFuture<T> |
PgxFuture.cancelOn(PgxFuture promise)
If given promise completes exceptionally because it was canceled,
cancel() gets called on this promise as well. |
PgxFuture<T> |
PgxFuture.thenComplete(PgxFuture<T> promise)
completes the given promise whenever this completes.
|
PgxFuture<T> |
PgxFuture.thenComplete(PgxFuture<T> promise, Runnable cleanup)
completes the given promise whenever this completes.
|
Modifier and Type | Method and Description |
---|---|
static <T> PgxFuture<Void> |
PgxFuture.allOf(List<PgxFuture<T>> promises) |
Modifier and Type | Method and Description |
---|---|
PgxFuture<Void> |
Control.addPinnedGraph(GraphConfig cfg)
Add a pinned graph (will not be unloaded by engine) to be shared between sessions
|
PgxFuture<Void> |
Control.demotePinnedGraph(GraphConfig cfg)
Demote pinned graph.
|
PgxFuture<GraphInfo> |
Control.getGraphInfo(String graphName)
Get details of a (shared) persistent graph
|
PgxFuture<GraphInfo> |
Control.getGraphInfo(String sessionId, String graphName)
Get details of a session-bound, private graph
|
PgxFuture<Collection<GraphInfo>> |
Control.getGraphInfos()
Get a list of currently active graphs.
|
PgxFuture<MemoryInfo> |
Control.getMemoryInfo()
Gets the memory info.
|
PgxFuture<Map<PgxConfig.Field,Object>> |
Control.getPgxConfig()
Gets the pgx config.
|
PgxFuture<SessionInfo> |
Control.getSessionInfo(String sessionId)
Gets the session info.
|
PgxFuture<Collection<SessionInfo>> |
Control.getSessionInfos()
Gets the session infos.
|
PgxFuture<PoolInfo> |
Control.getThreadPoolInfo(PoolType type)
Gets the thread pool info.
|
PgxFuture<Boolean> |
Control.isRunning()
Check if the engine is currently up
|
PgxFuture<Void> |
Control.killSession(String sessionId)
Kill session.
|
PgxFuture<GraphConfig> |
Control.lookupPreloadedGraph(String name)
look up the config of a pre-loaded graph by name.
|
PgxFuture<Void> |
Control.resizePool(PoolType poolType, int parallelism)
resize a pool to use a different degree of parallelism
|
PgxFuture<Boolean> |
Control.shutdown(long timeout, TimeUnit unit)
gracefully shuts down the engine and cleans up resources.
|
PgxFuture<Void> |
Control.shutdownNow()
forces the engine to stop and clean up resources.
|
PgxFuture<Void> |
AbstractControl.shutdownNowIfRunning() |
PgxFuture<Void> |
Control.shutdownNowIfRunning() |
PgxFuture<Void> |
AbstractControl.start() |
PgxFuture<Void> |
Control.start() |
PgxFuture<Void> |
AbstractControl.start(InputStream config) |
PgxFuture<Void> |
Control.start(InputStream config) |
PgxFuture<Void> |
AbstractControl.start(Map<PgxConfig.Field,Object> config) |
PgxFuture<Void> |
Control.start(Map<PgxConfig.Field,Object> config) |
PgxFuture<Void> |
Control.start(String json) |
Copyright © 2015. All rights reserved.